Remarks on a 25 year old Theorem on Two-dimensional Cellular Automata

نویسندگان

  • James M. Greenberg
  • Curtis Greene
  • S. P. Hastings
چکیده

The purpose of this brief note is to call attention to a theorem published almost twenty-…ve years ago [GGH] on two dimensional cellular automata which we believe is still of interest, but which seems to be very little known. One reason for this obscurity may be that when we wrote this paper, we did not know the term " cellular automata " , and so it does not appear in the title or elsewhere in the paper. A second reason may be that the journal itself was discontinued more than 15 years ago. Despite the long intervening period, we are not aware of another theorem like it in this …eld. The model in question is quite well known, as a discrete model of " excitable media ". See for example [W], where the model is described (with acknowledgement) and some of the patterns are shown. What seems to be largely unknown is that we proved a theorem which allows one to predict from the initial condition an important aspect of the long time behavior of this model. The theorem is based on de…ning a " topological invariant " for the model. We now state a special case of the main result in the paper, in order for the reader to decide quickly if the result indeed merits reading further, and perhaps even looking up the original reference. We consider a speci…c three-state cellular automata on a two-dimensional square lattice. This means that to each index pair (i; j), and for each integer valued " time " n 0: we associate a number from the set f0;

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Frog Leaping Algorithm Using Cellular Learning Automata

In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...

متن کامل

Fault-tolerant adder design in quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...

متن کامل

Remarks on permutive cellular automata

We prove that every n-dimensional permutive cellular automaton is conjugate to a one-sided shift with compact set of states. This is a generalization of a theorem of R. Gilman.

متن کامل

Myhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata

Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...

متن کامل

Fault-tolerant adder design in quantum-dot cellular automata

Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJUC

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2005